A Fast IP Lookups using Dynamic Trie Compression
نویسندگان
چکیده
منابع مشابه
Simple and fast IP lookups using binomial spanning trees
High performance Internet routers require an efficient IP lookup algorithm to forward millions of packets per second. Various binary trie data structures are normally used in software-based routers. Binary trie based lookup algorithms are simple not only for searching for the longest prefix match but also for updating the routing table. In this paper, we propose a new IP lookup algorithm based ...
متن کاملBinary search schemes for fast IP lookups
IP route look up is the most time consuming operation of a router. Route lookup is becoming a very challenging problem due to the increasing size of routing tables. To reduce the number of entries, routing tables store variable length address prefixes. To determine the outgoing port for a given address, the longest matching prefix amongst all the prefixes, needs to be determined. This makes the...
متن کاملHigh Speed Networks FAST IP LOOKUPS USING A TWO-TFUE DATA STRUCTURE
IP routing table lookup has been considered as a major bottleneck for high performance routers. In this paper, we propose a new way to do IP route lookups based on a socalled two trie structure. The two-trie structure shares the nodes representing the front and the rear parts of the prefixes. This results in reducing the number of nodes in the structure. Our results indicate that the memory can...
متن کاملEfficient Caching for IP Lookups
IP address lookups form a critical component of the internet routing infrastructure. Typically based on trie-based structures and related extensions, the problem has several similarities to other applications of dictionaries in data compression, information retrieval, etc. The extreme need for speed in IP lookups has prompted considerable research in development of appropriate data structures, ...
متن کاملIP Routing Lookups Algorithms Evaluation
We consider the problem of organizing the Internet routing tables in such a way as to enable fast routing lookup performance We concentrate on two recently proposed methods and try to evaluate their performance We describe our implementation of the methods and results of performance measurements on existing as well as arti cially generated input data We present some conclusions about the genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartA
سال: 2003
ISSN: 1598-2831
DOI: 10.3745/kipsta.2003.10a.5.453